Continuously controlled K-theory with variable coefficients

نویسندگان
چکیده

منابع مشابه

Optimized Schwarz Methods for Model Problems with Continuously Variable Coefficients

Abstract. Optimized Schwarz methods perform better than classical Schwarz methods because 6 they use more e↵ective transmission conditions between subdomains. These transmission conditions 7 are determined by optimizing the convergence factor, which is obtained by Fourier analysis for simple 8 two subdomain model problems. Such optimizations have been performed for many di↵erent types of 9 part...

متن کامل

Design of Continuously Variable Transmission (CVT) with Metal Pushing Belt and Variable Pulleys

Nowadays, automakers have invested in new technologies in order to improve the efficiency of their products. Giant automakers have taken an important step toward achieving this objective by designing continuously variable transmission systems (CVT) to continuously adapt the power of the engine with the external load according to the optimum efficiency curve of e...

متن کامل

Continuously Controlled Algebraic K-theory of Spaces and the Novikov Conjecture

Here the L-polynomial is a certain rational polynomial in the Pontrjagin classes. This theorem is surprising from many points of view: the left hand side is obviously a homotopy invariant and an integer, whereas the right hand side a priory is only a smooth invariant and a rational number. This led Novikov to the following conjecture: If M has fundamental group π and x is an element in H∗(Bπ), ...

متن کامل

Controlled K - Theory

The controlled finiteness obstruction and torsion are defined using controlled algebra, giving a more algebraic proof of the topological invariance of torsion and the homotopy finiteness of compact ANRs.

متن کامل

Random Walk with Continuously Smoothed Variable Weights

Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for long periods in deep local minima. Clause weighting algorithms such as DLM, GLS, ESG and SAPS are good at escaping local minima but require expensive smoothing phases in which all weights are updated. We show that Wa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 2000

ISSN: 0022-4049

DOI: 10.1016/s0022-4049(98)00084-x